Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness–Tardiness Cost

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined the assigned to job. allocation model is divided into linear convex models, our goal find an optimal location, job sequence allocation. We prove that weighted sum of cost (including general earliness–tardiness penalties positional-dependent weights) consumption minimization polynomially solvable. In addition, under allocation, we show (resp. consumption) solvable in polynomial subject scheduling) being bounded.